public class Likou_lianx1 {
    public class Likou_l1 {
        class Solution {
            public int[] twoSum(int[] nums, int target) {
                for(int i = 0; i<nums.length;i++){
                    for(int j=i+1; j<nums.length; j++){
                        if(nums[i]+nums[j] == target ){
                            return new int[]{i,j};
                        }
                    }
                }
                return new int[0];
            }
        }
    }

}
